Description: 模拟退火解决旅行商（TSP问题）采用康立山等人的算法 能得到最优解，速度可以-Kang Tateyama simulated annealing to solve the traveling salesman (TSP problems) algorithm can get the optimal solution can speed Platform: |
Size: 1024 |
Author:Jason |
Hits:
Description: 用matlab实现的基于模拟退火算法的旅行商问题即TSP问题-Achieved using matlab simulated annealing algorithm for the traveling salesman problem TSP problem Platform: |
Size: 1024 |
Author:陈晓 |
Hits:
Description: 旅行商问题，使用模拟退火算法和遗传算法解决的代码。-The traveling salesman problem using the simulated annealing algorithm and genetic algorithm to solve the code. Platform: |
Size: 1840128 |
Author: |
Hits:
Description: 针对旅行商问题的随机模拟退火算法，可以使用-Random simulated annealing algorithm for the traveling salesman problem, you can use Platform: |
Size: 2048 |
Author:longway |
Hits:
Description: 一个模拟退火算法，计算旅行商问题：注意：一共三个文件，第一个是主程序，下面两个是子函数-A simulated annealing algorithm to calculate the traveling salesman problem: Note: A total of three files, the first one is the main program, the following two sub-functions Platform: |
Size: 10240 |
Author:hxliang |
Hits:
Description: 人工智能中的经典算法，TSP模拟退火算法。本程序简单实现了的用模拟退火算法实现了旅行商问题。只需在文本cities中输入各个城市之间的距离，运行程序后就可以求出旅行各个城市的最短距离。适合学习人工智能和对该算法有兴趣的同学使用。-Classic artificial intelligence algorithm, TSP simulated annealing algorithm. The program is simple to achieve with simulated annealing algorithm for traveling salesman problem. Simply enter the distance between the various cities in the text cities after running the program can be calculated in various cities of the travel the shortest distance. Use for learning students who are interested in artificial intelligence and the algorithm. Platform: |
Size: 36864 |
Author:李辉 |
Hits:
Description: 模拟退火算法解决旅行商问题，10、20点找到最优解的概率约为0.8-Simulated annealing algorithm to solve the traveling salesman problem, the probability of 10,20 points to find the optimal solution is approximately 0.8 Platform: |
Size: 29696 |
Author:张沂超 |
Hits:
Description: 用模拟退火算法解决旅行商问题，城市坐标是数据集直接调用。-Simulated annealing algorithm to solve the traveling salesman problem, the city coordinates data sets directly call. Platform: |
Size: 5120 |
Author: |
Hits:
Description: 模拟退火法的原理说明和基于模拟退火法的货郎担问题求解。-The principle of simulated annealing algorithm based on simulated annealing algorithm description and the traveling salesman problem solving. Platform: |
Size: 61440 |
Author:邵珠贵 |
Hits:
Description: SP(旅行商)问题代表组合优化问题,具有很强的工程背景和实际应用价值,但至今尚未找到非常有效的
求解方法.为此,讨论了最近研究比较热门的使用各种智能优化算法(蚁群算法、遗传算法、模拟退火算法、禁忌搜索
算法、Hopfield神经网络、粒子群优化算法、免疫算法等)求解 TSP问题的研究进展,指出了各种方法的优缺点和改
进策略.最后总结并提出了智能优化算法求解 TSP问题的未来研究方向和建议.
-Traveling salesman problem (TSP) is the representation of a kind of combination optimization problems,
possessing a strong engineering background and practical application value. However, there is no effective corre
2 sponding solution to it. A im at that, the research and application of themostpopularmeta
2heuristicmethods such as ant colony algorithm, genetic algorithm, simulated annealing, tabu search, hopfield neural network, particle swarm optimization and immune algorithm, etc. are reviewed. The advantages and disadvantages of each method and the improvement strategies are discussed. The future research direction and sug
Platform: |
Size: 399360 |
Author:chenchen |
Hits:
Description: 用模拟退火算法解决tsp(旅行商问题)，可以和其他算法融合-Using simulated annealing algorithm to solve tsp (traveling salesman problem), and other algorithms can be fused Platform: |
Size: 19456 |
Author:chenzhen |
Hits:
Description: 基于经典的优化算法--模拟退火算法的旅行商问题寻优实现，该算法比较经典，可用于后续一些性能对比分析-The traveling salesman problem-- the classical optimization algorithms and simulated annealing algorithm is implemented based on the algorithm, compare the classic, can be used for the analysis of subsequent performance comparison Platform: |
Size: 5120 |
Author:颜妍 |
Hits:
Search - salesman annealing